Relaxing relationship queries on graph data
نویسندگان
چکیده
منابع مشابه
Relaxing Queries with Hierarchical Quantified Data Abstraction
Query relaxation is one of the crucial components for approximate query answering. Query relaxation has extensively been investigated in terms of categorical data; few studies, however, have been effectively established for both numerical and categorical data. In this article, we develop a query relaxation method by exploiting hierarchical quantified data abstraction, and a novel method is prop...
متن کاملExpressive Path Queries on Graph with Data
Graph data models have recently become popular owing to their applications, e.g., in social networks and the semantic web. Typical navigational query languages over graph databases — such as Conjunctive Regular Path Queries (CRPQs) — cannot express relevant properties of the interaction between the underlying data and the topology. Two languages have been recently proposed to overcome this prob...
متن کاملContainment of Data Graph Queries
The graph database model is currently one of the most popular paradigms for storing data, used in applications such as social networks, biological databases and the Semantic Web. Despite the popularity of this model, the development of graph database management systems is still in its infancy, and there are several fundamental issues regarding graph databases that are not fully understood. Inde...
متن کاملTopological Queries on Graph-structured XML Data: Models and Implementations
In many applications, data is in graph structure, which can be naturally represented as graph-structured XML. Existing queries defined on tree-structured and graph-structured XML data mainly focus on subgraph matching, which can not cover all the requirements of querying on graph. In this paper, a new kind of queries, topological query on graph-structured XML is presented. This kind of queries ...
متن کاملImplementing Path Queries on Graph Views of Relational Data
We have investigated path query algorithms which can provide efficient retrieval of paths in graph views of relational data. One advantage of supporting such a graph view is that it has the potential to support queries of the form “what is the relationship between object A and object B?”. Such path queries are not possible with a conventional relational design, but if supported would enable kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Web Semantics
سال: 2020
ISSN: 1570-8268
DOI: 10.1016/j.websem.2020.100557